An Enhanced Residue Modular Multiplier for Cryptography
نویسنده
چکیده
This paper presents an implementation of VLSI architecture for Dual Field Residue Arithmetic modular multiplier with less delay based on finite field arithmetic to support all public key cryptographic applications. A new method for incorporating Residue Number System (RNS) and Polynomial Residue Number system (PRNS) in modular multiplication is derived and then implemented VLSI Architecture for dual field residue arithmetic modular multiplier with less delay . This architecture supports the conversions, modular multiplication for polynomials and integers and modular exponentiation in same hardware. This architecture has a carry save adders (CSAs) and parallel prefix adders in MAC units to speed up the large integer arithmetic operations over GF(P) and GF(2),hence this reduces the delay up to 10 percent.
منابع مشابه
An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystem. The previous Montgomery multipliers perform a single Montgomery multiplication in approximately 2n clock cycles and it requires more number of addition stages for large word length addition, where n is the size of operands in bits. In this paper, ...
متن کاملHigh-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier
A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).
متن کاملDesign Of Modulo − Multipliers Using DR-RNS Based On Radix-8 Booth Encoded Algorithm
Modular arithmetic operations l ike inversion, multiplication and exponentiation are used in several cryptography applications. A special modulo set of forms {21,2,2+1}are preferred over the generic modulo due to the ease of hardware implementation of modulo arithmetic functions as well as systemlevel intermodulo operations, such as RNS-to-binary conversion and sign detections. Key sizes in the...
متن کاملStudies on Modular Arithmetic Hardware Algorithms for Public-key Cryptography
Public-key cryptography plays an important role in digital communication and storage systems. Processing public-key cryptosystems requires huge amount of computation, and, there is therefore, a great demand for developing dedicated hardware to speed up the computations. In this thesis, we focus on modular arithmetic hardware algorithms for public-key cryptosystem since these two operations are ...
متن کاملSpeeding Up Bipartite Modular Multiplication
A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks on public-key cryptosystems, we show that the proposed set is safe to use in practice for both elliptic curve cryptography and RSA cryptosystems. We propose a hardware architecture for the modular multiplier that is based on our...
متن کامل